Distributed processes and location failures
نویسندگان
چکیده
منابع مشابه
Distributed processes and location failures
Site failure is an essential aspect of distributed systems; nonetheless its effect on programming language semantics remains poorly understood. To model such systems, we define a process calculus in which processes are run at distributed locations. The language provides operators to kill locations, to test the status (dead or alive) of locations, and to spawn processes at remote locations. Usin...
متن کاملUNIVERSITY OF SUSSEX COMPUTER SCIENCE Distributed Processes and Location Failures
Site failure is an essential aspect of distributed systems; nonetheless its effect on programming language semantics remains poorly understood. To model such systems, we define a process calculus in which processes are run at distributed locations. The language provides operators to kill locations, to test the status (dead or alive) of locations, and to spawn processes at remote locations. Usin...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملDistributed cognition models for human factors failures in operating and design processes
A set of about 60 offshore incident reports was obtained and combined with a small set of reports of inquiries into full scale offshore accidents and then developed into cause-effect analyses. In each case the task was to identify how people's problem solving had been distributed, how this distribution had failed, and the assumptions that they had been making, by implication. It was these impli...
متن کاملLocalizing Failures in Distributed Synchronization
We investigate the fault-tolerance of distributed algorithms in asynchronous message passing systems with undetectable process failures. We introduce failure locality as a measure of the fault-tolerance of distributed algorithms. This measure captures the general idea of allowing part of a system to continue to function despite the failure of other parts of the system. We concentrate on two pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00326-1